Everlasting Multi-party Computation
نویسندگان
چکیده
منابع مشابه
Multi-party Quantum Computation
We investigate definitions of and protocols for multi-party quantum computing in the scenario where the secret data are quantum systems. We work in the quantum information-theoretic model, where no assumptions are made on the computational power of the adversary. For the slightly weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t < n/4 cheating parties (o...
متن کاملOutsourcing Multi-Party Computation
We initiate the study of secure multi-party computation (MPC) in a server-aided setting, where the parties have access to a single server that (1) does not have any input to the computation; (2) does not receive any output from the computation; but (3) has a vast (but bounded) amount of computational resources. In this setting, we are concerned with designing protocols that minimize the computa...
متن کاملUnconditionally Secure Multi-Party Computation
The most general type of multi-party computation involves n participants. Participant i supplies private data xi and obtains an output function fi(x1, . . . , xn). The computation is said to be unconditionally secure if each participant can verify, with probability arbitrarily close to one, that every other participant obtains arbitrarily little information beyond their agreed output fi. We giv...
متن کاملHeterogeneous Secure Multi-Party Computation
The increased processing power and storage capacity of inhome and mobile computing devices has motivated their inclusion in distributed and cloud computing systems. The resulting diverse environment creates a strong requirement for secure computations, which can be realised by Secure Multi-Party Computation (MPC). However, MPC most commonly assumes that parties performing the secure computation...
متن کاملEfficient Secure Multi-party Computation
Since the introduction of secure multi-party computation, all proposed protocols that provide security against cheating players suffer from very high communication complexities. The most efficient unconditionally secure protocols among n players, tolerating cheating by up to t < n/3 of them, require communicating O(n6) field elements for each multiplication of two elements, even if only one pla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2018
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-018-9278-z